LR-regular grammars—an extension of LR(k) grammars
نویسندگان
چکیده
منابع مشابه
The Equivalence Problem for LL- and LR-Regular Grammars
Questions whether or not two grammars belonging to a family of grammars generate the same language have extensively been studied in the literature. These problems are called equivalence problems and if there exists an algorithm which for each pair of grammars of this family gives an answer to this question then the equivalence problem for this family of grammars is said to be decidable. Otherwi...
متن کاملSimple LR ( k ) Grammars Franklin
A class of context-free grammars, called the "Simple LR(k)" or SLR(k) grammars is defined. This class has been shown to include weak precedence and simple precedence grammars as proper subsets. How to construct parsers for the SLR(k) grammars is also shown. These parser-construction techniques are extendible to cover all of the LR(k) grammars of Knuth; they have been implemented and by direct c...
متن کاملThe Hierarchy of LR-Attributed Grammars
The problem of attribute evaluation during LR parsing is considered. Several definitions of LR-attributed grammars are presented. Relations of corresponding attribute grammar classes are analysed. Also the relations between LR-attributed grammars and LL-attributed grammars and between LR-attributed grammars and a class of one-pass attributed grammars based on left-corner grammars are considered.
متن کاملParallel Evaluation of LR–Attributed Grammars
In this paper, we present a novel approach to the parallel implementation of one–pass compilers. Based on attribute grammars, it combines the well–known LR parsing technique for the underlying context–free grammar with the parallel evaluation of attribution rules. In order to integrate syntactic and semantic analysis, the LR parsing stack is enriched by additional information, resulting in a so...
متن کاملGeneralized LR Parsing for Grammars with Contexts
The Generalized LR parsing algorithm for context-free grammars is notable for having a decent worst-case running time (cubic in the length of the input string), as well as much better performance on “good” grammars. This paper extends the Generalized LR algorithm to the case of “grammars with left contexts” (M. Barash, A. Okhotin, “An extension of context-free grammars with one-sided context sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1973
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(73)80050-9